Sparse Gaussian Elimination on High Performance
نویسندگان
چکیده
Sparse Gaussian Elimination on High Performance Computers
منابع مشابه
Sparse Gaussian Elimination on High Performance Computers
Sparse Gaussian Elimination on High Performance Computers
متن کاملParallel Sparse Gaussian Elimination with Partial Pivoting and 2-d Data Mapping Parallel Sparse Gaussian Elimination with Partial Pivoting and 2-d Data Mapping Abstract Parallel Sparse Gaussian Elimination with Partial Pivoting and 2-d Data Mapping
Sparse Gaussian elimination with partial pivoting is a fundamental algorithm for many scientiic and engineering applications, but it is still an open problem to develop a time and space eecient algorithm on distributed memory machines. In this thesis, we present an asynchronous algorithm which incorporates static symbolic factorization, nonsymmetric L/U supernode partitioning and supern-ode ama...
متن کاملThreshold-pivoting in parallel Gaussian elimination for improved efficiency
The use of threshold pivoting with the purpose to reduce fill-in during sparse Gaussian elimination has been generally acknowledged. Here we describe the application of threshold pivoting in dense Gaussian elimination for improving the performance of a parallel implementation. We discuss the effect on the numerical stability and conclude that the consequences are only of minor importance as lon...
متن کاملEfficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures
A sparse LU factorization based on Gaussian elimination with partial pivoting (GEPP) is important to many scientific applications, but it is still an open problem to develop a high performance GEPP code on distributed memory machines. The main difficulty is that partial pivoting operations dynamically change computation and nonzero fill-in structures during the elimination process. This paper p...
متن کاملEecient Sparse Lu Factorization with Partial Pivoting on Distributed Memory Architectures
A sparse LU factorization based on Gaussian elimination with partial pivoting (GEPP) is important to many scientiic applications, but it is still an open problem to develop a high performance GEPP code on distributed memory machines. The main diiculty is that partial pivoting operations dynamically change computation and nonzero ll-in structures during the elimination process. This paper presen...
متن کامل